Solving a real-time allocation problem with constraint programming
نویسندگان
چکیده
منابع مشابه
Solving a real-time allocation problem with constraint programming
In this paper, we present an original approach (CPRTA for ”Constraint Programming for solving Real-Time Allocation”) based on constraint programming to solve a static allocation problem of hard real-time tasks. This problem consists in assigning periodic tasks to distributed processors in the context of fixed priority preemptive scheduling. CPRTA is built on dynamic constraint programming toget...
متن کاملSolving Allocation Problems of Hard Real-Time Systems with Dynamic Constraint Programming
In this paper, we present an original approach (CPRTA for ”Constraint Programming for solving Real-Time Allocation”) based on constraint programming to solve an allocation problem of hard real-time tasks in the context of fixed priority preemptive scheduling. CPRTA is built on dynamic constraint programming together with a learning method to find a feasible processor allocation under constraint...
متن کاملSolving a Stochastic Queueing Control Problem with Constraint Programming
In this paper, a retail facility which has front room and back room operations, and crosstrained workers, is considered. In particular, it is of interest to the facility to determine optimal times for switching workers between the two rooms under stochastic customer arrival so that expected customer waiting time is minimized, but all work in the back room is performed. Three constraint programm...
متن کاملSolving a Log-Truck Scheduling Problem with Constraint Programming
Scheduling problems in the forest industry have received significant attention in the recent years and have contributed many challenging applications for optimization technologies. This paper proposes a solution method based on constraint programming and mathematical programming for a log-truck scheduling problem. The problem consists of scheduling the transportation of logs between forest area...
متن کاملSolving a Workforce Management Problem with Constraint Programming
A workforce management problem in service industries is to determine how to allocate employees to jobs such that the service demand can be satis ed as much as possible at minimum cost. It has been studied in the Operations Research, Genetic Algorithms and other areas. Recently, Constraint Logic Programming (CLP) has provided a declarative and powerful tool which has been successfully used to so...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Systems and Software
سال: 2008
ISSN: 0164-1212
DOI: 10.1016/j.jss.2007.02.032